On Fast Running Max-Min Filtering

نویسندگان

  • Dinu Coltuc
  • Ioannis Pitas
چکیده

The problem of fast running max/min lters for arbitrary-size windows is addressed. The size of the lter window is increased to the least power of two greater than the given size and the input sequence is expanded. The running max/min computation uses a fast algorithm for power of two window sizes, as described in 1]. The computational complexity (comparisons per sample) of the proposed algorithm is very close to log 2 n, where n is the size of the given window. A exible hardware implementation for n ranging between two consecutive powers of two is discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource Efficient Hardware Architecture for Fast Computation of Running Max/Min Filters

Running max/min filters on rectangular kernels are widely used in many digital signal and image processing applications. Filtering with a k × k kernel requires of k(2) - 1 comparisons per sample for a direct implementation; thus, performance scales expensively with the kernel size k. Faster computations can be achieved by kernel decomposition and using constant time one-dimensional algorithms o...

متن کامل

Fast Computation of a Class of Running

The paper focuses on the computation of a class of running lters deened as the n-ary extension of an associative, commutative and idempotent binary operation T on an ordered sequence of operands. The well-known max/min lters are the prominent representatives of the class. For any arbitrary window lter of size n, the existence of a fast algorithm of complexity O(log 2 n) T-operations is proven. ...

متن کامل

Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths

Given a directed graph with a capacity on each edge, the all-pairs bottleneck paths (APBP) problem is to determine, for all vertices s and t, the maximum flow that can be routed from s to t. For dense graphs this problem is equivalent to that of computing the (max,min)transitive closure of a real-valued matrix. In this paper, we give a (max,min)-matrix multiplication algorithm running in time O...

متن کامل

Pulmonary gas exchange during exercise in women: effects of exercise type and work increment.

Exercise-induced arterial hypoxemia (EIAH) has been reported in male athletes, particularly during fast-increment treadmill exercise protocols. Recent reports suggest a higher incidence in women. We hypothesized that 1-min incremental (fast) running (R) protocols would result in a lower arterial PO(2) (Pa(O(2))) than 5-min increment protocols (slow) or cycling exercise (C) and that women would ...

متن کامل

Effect of speed endurance training and reduced training volume on running economy and single muscle fiber adaptations in trained runners

The aim of the present study was to examine whether improved running economy with a period of speed endurance training and reduced training volume could be related to adaptations in specific muscle fibers. Twenty trained male (n = 14) and female (n = 6) runners (maximum oxygen consumption (VO2 -max): 56.4 ± 4.6 mL/min/kg) completed a 40-day intervention with 10 sessions of speed endurance train...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995